Total monochromatic connection of graphs
نویسندگان
چکیده
منابع مشابه
Total proper connection of graphs
A graph is said to be total-colored if all the edges and the vertices of the graph is colored. A path in a total-colored graph is a total proper path if (i) any two adjacent edges on the path differ in color, (ii) any two internal adjacent vertices on the path differ in color, and (iii) any internal vertex of the path differs in color from its incident edges on the path. A total-colored graph i...
متن کاملTotal rainbow k-connection in graphs
Let k be a positive integer and G be a k-connected graph. In 2009, Chartrand, Johns, McKeon, and Zhang introduced the rainbow k-connection number rck(G) of G. An edge-coloured path is rainbow if its edges have distinct colours. Then, rck(G) is the minimum number of colours required to colour the edges of G so that any two vertices of G are connected by k internally vertex-disjoint rainbow paths...
متن کاملMonochromatic Clique Decompositions of Graphs
Let G be a graph whose edges are colored with k colors, and H=(H1,⋯,Hk) be a k-tuple of graphs. A monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic copy of Hi in color i, for some 1≤i≤k. Let φk(n,H) be the smallest number ϕ, such that, for every order-n graph and every k-edge-coloring, there is a monochrom...
متن کاملMonochromatic Kr-Decompositions of Graphs
Given graphs G and H, and a colouring of the edges of G with k colours, a monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic graph isomorphic to H. Let φk(n,H) be the smallest number φ such that any k-edge-coloured graph G of order n, admits a monochromatic H-decomposition with at most φ parts. Here we stud...
متن کاملMonochromatic KrKr-Decompositions of Graphs
Given graphs G and H, and a colouring of the edges of G with k colours, a monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic graph isomorphic to H. Let φk(n,H) be the smallest number φ such that any graph G of order n and any colouring of its edges with k colours, admits a monochromatic Hdecomposition with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.08.020